Scalable Empirical Dynamic Modeling with Parallel Computing and Approximate k-NN Search

نویسندگان

چکیده

Empirical Dynamic Modeling (EDM) is a mathematical framework for modeling and predicting non-linear time series data. Although EDM increasingly adopted in various research fields, its application to large-scale data has been limited due high computational cost. This article presents kEDM, high-performance implementation of analyzing datasets. kEDM adopts the Kokkos performance-portable programming model efficiently run on both CPU GPU while sharing single code base. We also conduct hardware-specific optimization performance-critical kernels. achieved up 6.58× speedup pairwise causal inference real-world biology datasets compared an existing implementation. Furthermore, we integrate multiple approximate k-NN search algorithms into enable analysis extremely large that were intractable with conventional based exhaustive search. EDM-based forecast enhanced demonstrated 790× Simplex projection less than 1% increase MAPE.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scalable $k$-NN graph construction

The k-NN graph has played a central role in increasingly popular data-driven techniques for various learning and vision tasks; yet, finding an efficient and effective way to construct k-NN graphs remains a challenge, especially for large-scale high-dimensional data. In this paper, we propose a new approach to construct approximate k-NN graphs with emphasis in: efficiency and accuracy. We hierar...

متن کامل

Fast k-NN search

Random projection trees have proven to be effective for approximate nearest neighbor searches in high dimensional spaces where conventional methods are not applicable due to excessive usage of memory and computational time. We show that building multiple trees on the same data can improve the performance even further, without significantly increasing the total computational cost of queries when...

متن کامل

Dynamic Performance Prediction for Scalable Parallel Computing

Performance prediction is necessary in order to deal with multi-dimensional performance eeects on parallel systems. The compiler-generated analytical model developed in this paper accounts for the eeects of cache behavior, CPU execution time and message passing overhead for real programs written in high level data-parallel languages. The performance prediction technique is shown to be eeective ...

متن کامل

Privately Computing a Distributed k-nn Classifier

The ability of databases to organize and share data often raises privacy concerns. Data warehousing combined with data mining, bringing data from multiple sources under a single authority, increases the risk of privacy violations. Privacy preserving data mining provides a means of addressing this issue, particularly if data mining is done in a way that doesn’t disclose information beyond the re...

متن کامل

Scalable Parallel DFPN Search

We present Scalable Parallel Depth-First Proof Number Search, a new shared-memory parallel version of depth-first proof number search. Based on the serial DFPN 1+ε method of Pawlewicz and Lew, SPDFPN searches effectively even as the transposition table becomes almost full, and so can solve large problems. To assign jobs to threads, SPDFPN uses proof and disproof numbers and two parameters. SPDF...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3289836